翻訳と辞書 Words near each other ・ Covered Wagon (sculpture) ・ Covered Wagon Days ・ Covered Wagon Raid ・ Covered warrant ・ Covered with Ants ・ Covered, A Revolution in Sound ・ CoverGirl ・ Covergirl (album) ・ COVERguy ・ Coverham ・ Coverham Abbey ・ Coverham with Agglethorpe ・ Covering ・ Covering (martial arts) ・ Covering a base ・ Covering code ・ Covering force ・ Covering graph ・ Covering Ground ・ Covering group ・ Covering groups of the alternating and symmetric groups ・ Covering Islam ・ Covering Kids and Families of Indiana ・ Covering lemma ・ Covering number ・ Covering of the eyes ・ Covering of the Senne ・ Covering problem of Rado ・ Covering problems ・ Covering relation Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Covering code ： ウィキペディア英語版 Covering code In coding theory, a covering code is a set of elements (called ''codewords'') in a space, with the property that every element of the space is within a fixed distance of some codeword. == Definition == Let $q\backslash geq\; 2$, $n\backslash geq\; 1$, $R\backslash geq\; 0$ be integers. A code $C\backslash subseteq\; Q^n$ over an alphabet ''Q'' of size |''Q''| = ''q'' is called ''q''-ary ''R''-covering code of length ''n'' if for every word $y\backslash in\; Q^n$ there is a codeword $x\backslash in\; C$ such that the Hamming distance $d\_H(x,y)\backslash leq\; R$. In other words, the spheres (or balls or rook-domains) of radius ''R'' with respect to the Hamming metric around the codewords of ''C'' have to exhaust the finite metric space $Q^n$. The covering radius of a code ''C'' is the smallest ''R'' such that ''C'' is ''R''-covering. Every perfect code is a covering code of minimal size. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Covering code」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.